A low multiplicative complexity fast recursive DCT-2 algorithm
نویسندگان
چکیده
A fast Discrete Cosine Transform (DCT) algorithm is introduced that can be of particular interest in image processing. The main features of the algorithm are regularity of the graph and very low arithmetic complexity. The 16-point version of the algorithm requires only 32 multiplications and 81 additions. The computational core of the algorithm consists of only 17 nontrivial multiplications, the rest 15 are scaling factors that can be compensated in the post-processing. The derivation of the algorithm is based on the algebraic signal processing theory (ASP).
منابع مشابه
On Fast Algorithm for Computing Even-Length DCT
We study recursive algorithm for computing DCT of lengths N = q 2m (m, q ∈ N, q is odd) due to C. W. Kok [16]. We show that this algorithm has the same multiplicative complexity as theoretically achievable by the prime factor decomposition, when m 6 2. We also show that C. W. Kok’s factorization allows a simple conversion to a scaled form. We analyze complexity of such a scaled factorization, a...
متن کاملEfficient Computation of the 8-point DCT via Summation by Parts
This paper introduces a new fast algorithm for the 8-point discrete cosine transform (DCT) based on the summation-by-parts formula. The proposed method converts the DCT matrix into an alternative transformation matrix that can be decomposed into sparse matrices of low multiplicative complexity. The method is capable of scaled and exact DCT computation and its associated fast algorithm achieves ...
متن کاملA Digital Hardware Fast Algorithm and FPGA-based Prototype for a Novel 16-point Approximate DCT for Image Compression Applications
The discrete cosine transform (DCT) is the key step in many image and video coding standards. The 8-point DCT is an important special case, possessing several low-complexity approximations widely investigated. However, 16-point DCT transform has energy compaction advantages. In this sense, this paper presents a new 16-point DCT approximation with null multiplicative complexity. The proposed tra...
متن کاملNew hardware-efficient algorithm and architecture for the computation of 2-D DCT on a linear systoli - Acoustics, Speech, and Signal Processing, 1999. Proceedings., 1999 IEEE International Conference o
A new recursive algorithm for fast computation of twodimensional discrete cosine transforms (2-D DCT) is derived by converting the 2-D data matrices into 1-D vectors and then using different partition methods for the time and frequency indices. The algorithm first computes the 2-D complex DCT (2-D CCT) and then produces two 2-D DCT outputs simultaneously through a post-addition step. The decomp...
متن کاملLow Complexity and High speed in Leading DCD ERLS Algorithm
Adaptive algorithms lead to adjust the system coefficients based on the measured data. This paper presents a dichotomous coordinate descent method to reduce the computational complexity and to improve the tracking ability based on the variable forgetting factor when there are a lot of changes in the system. Vedic mathematics is used to implement the multiplier and the divider in the VFF equatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1203.3442 شماره
صفحات -
تاریخ انتشار 2012